Bottleneck-Based Makespan Algorithm For Cyber Manufacturing System

This paper presents alternative makespan computation algorithms for cyber manufacturing system (CMS) using bottleneck analysis. The CMS is an Internet-based collaborative design and manufacturing activities between Universiti Tun Hussein Onn Malaysia and the small and medium enterprises. The CMS processes scheduling resembles a four machine flow shop process routing of M1,M2,M3,M4,M3,M4 in which the last three processes of M4,M3,M4 always exhibiting bottleneck characteristics. It was shown that using detail bottleneck characteristic analysis, appropriate alternative bottleneck-based algorithm can be developed to compute the makespan for the CMS scheduling activities. This algorithm shows high accuracy within a specified localised sequence dependent limiting conditions. In cases where the limiting conditions are violated, a bottleneck correction factor is introduced in order to ensure accurate solution. These algorithms can later be used to develop appropriate heuristic to optimise the CMS scheduling problem.